Global Caching for the Alternation-free $\mu$-Calculus
نویسندگان
چکیده
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. The algorithm supports global caching with intermediate propagation and runs in time 2. In game-theoretic terms, our algorithm integrates the steps for constructing and solving the Büchi game arising from the input tableau into a single procedure; this is done onthe-fly, i.e. may terminate before the game has been fully constructed. This suggests a slogan to the effect that global caching = game solving on-the-fly. A prototypical implementation shows promising initial results. 1998 ACM Subject Classification F.4.1 Mathematical Logic Temporal Logic
منابع مشابه
Global Caching for the Alternation-free μ-Calculus
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. The algorithm supports global caching with intermediate propagation and runs in time 2O(n). In game-theoretic terms, our algorithm integrates the steps for constructing and solving the Büchi game arising from the input tableau into a single procedure; this is done onthe-fly, i.e. may ter...
متن کاملRelating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy
As already known [14], the mu-calculus [17] is as expressive as the bisimulation invariant fragment of monadic second order Logic (MSO). In this paper, we relate the expressiveness of levels of the fixpoint alternation depth hierarchy of the mu-calculus (the mu-calculus hierarchy) with the expressiveness of the bisimulation invariant fragment of levels of the monadic quantifiers alternation-dep...
متن کاملA Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
We develop a model-checking algorithm for a logic that permits propositions to be deened using greatest and least xed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identiied by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and behavioral preorders. Our algorithm deter...
متن کاملModel Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, that decides the full modal mu-calculus. Whereas the actual model checking algorithm results from considering conditional semantics together with backtracking caused by alternation, the corresponding correctness proof req...
متن کاملThe \mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کامل